Minimal stable partial realization

نویسندگان

  • Gerard Ledwich
  • John B. Moore
چکیده

An asymptotically stable minimal order realization of a partial sequence of Markov parameters is achieved by reducing the problem to a standard but minimal one in decision algebra. Summary—In this paper two equivalent sets of necessary and sufficient conditions for the existence of an asymptotically stable partial realization are developed. Both sets are expressed as multivariable polynomial equations which may be tested for the existence of a solution in a finite number of rational steps via decision methods. Should a solution exist, it may be evaluated with the aid of polynomial factorization. The first set of conditions are based on results due to Ho and Kalman, and are useful for the case where the number of specified Markov parameters is greater than the order of the realization. For other cases, the second set of conditions which include results from a companion paper on minimal observers, require less computational effort to be tested.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On partial realization and interpolation of models from orthogonal basis function expansions∗

In this paper we address the problem of computing a minimal state-space realization from partial knowledge of an expansion in terms of generalized rational orthogonal basis functions. The basis functions considered are generated by stable all-pass £lters. It is shown how a minimal state-space realization can be found on the basis of complete knowledge of the expansion coef£cients. Subsequently ...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

On the Partial Stochastic Realization Problem*

In this paper we describe a complete parameterization of the solutions to the partial stochastic realization problem in terms of a nonstandard matrix Riccati equation. Our analysis of this Covariance Extension Equation is based on a recent complete parameterization of all strictly positive real solutions to the rational covariance extension problem, answering a conjecture due to Georgiou in the...

متن کامل

On minimal realization of IF-languages: A categorical approach

he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...

متن کامل

An algebraic description of realizations of partial covariance sequences

The solutions of the partial realization problem have to satisfy a finite number of interpolation conditions at 1. The minimal degree of an interpolating deterministic system is called the algebraic degree or McMillan degree of the partial covariance sequence and is easy to compute. The solutions of the partial stochastic realization problem have to satisfy the same interpolation conditions and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Automatica

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1976